Links with homotopically trivial complements are trivial
نویسندگان
چکیده
منابع مشابه
Homotopically Non-trivial Maps with Small K-dilation
We construct homotopically non-trivial maps from Sm to Sn with arbitrarily small 3-dilation for certain pairs (m,n). The simplest example is the case m = 4, n = 3, and there are other pairs with arbitrarily large values of both m and n. We show that a homotopy class in π7(S) can be represented by maps with arbitrarily small 4-dilation if and only if the class is torsion. The k-dilation of a map...
متن کاملSome non-trivial PL knots whose complements are homotopy circles
We show that there exist non-trivial piecewise-linear (PL) knots with isolated singularities Sn−2 ⊂ Sn, n ≥ 5, whose complements have the homotopy type of a circle. This is in contrast to the case of smooth, PL locally-flat, and topological locally-flat knots, for which it is known that if the complement has the homotopy type of a circle, then the knot is trivial. It is well-known that if the c...
متن کاملA New Proof That Alternating Links Are Non-trivial
We use a simple geometric argument and small cancellation properties of link groups to prove that alternating links are non-trivial. This proof uses only classic results in topology and combinatorial group theory. 1. Statement of Results There are several approaches in the literature for showing that alternating links are non-trivial. Most of these approaches rely upon the use of a powerful kno...
متن کاملHow Trivial Is Trivial
This question is, I feel, in the same kind of idiot category as how long is a piece of string? interviewed recently by a journalist planning to write an article about the women (like me) who conduct 'Auntie' columns in women's magazines, I was asked what proportion of the letters I received each week could be labelled trivial. Her eyebrows shot up when I said that in my view, no human problem w...
متن کاملElections Are Conceptually Trivial
After everyone has voted, the votes in each ballot position are counted, and the winner of each race is declared. Barring the use of some form of ranked-preference ballot, the algorithms required are hardly more than mere summations. What makes elections difficult is the problem of performing this summation over a canvassing hierarchy spanning many polling places and local election offices, whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hiroshima Mathematical Journal
سال: 1995
ISSN: 0018-2079
DOI: 10.32917/hmj/1206127629